Testability in voting theory
نویسنده
چکیده
This paper argues that some parts of voting theory are inherently untestable. Theories which predict that an outcome of voting will be one that has a certain relation to individual preferences are particularly difficult to test because an empirical test requires information on those individual preferences, and such information is not available. This problem is particularly difficult in voting theory because the holism of the mental is particularly severe in this context.
منابع مشابه
What we know about software testability: a survey
Context: Software testability is the degree to which a software system or a unit under test supports its own testing. To predict and improve software testability, a large number of techniques and metrics have been proposed by both practitioners and researchers in the last several decades. Reviewing and getting an overview of the entire state-of-the-art and –practice in this area is often challe...
متن کاملDeterminants of Completing the Medication Reconciliation Form Among Nurses Based on Diffusion of Innovation Theory
Background &Objectives:Patientsafety is a global medical concern with remarkable influence onthe health of patients. Studies have suggested thattreatment-related damages occur in approximately 10% of patients at variable degrees, and more than a quarter of these damages are associated with medication errors. Medication errors could be diminished during patient hospitalization and transferusing ...
متن کاملTwo New Methods of Boundary Correction for Classifying Textural Images
With the growth of technology, supervising systems are increasingly replacing humans in military, transportation, medical, spatial, and other industries. Among these systems are machine vision systems which are based on image processing and analysis. One of the important tasks of image processing is classification of images into desirable categories for the identification of objects or their sp...
متن کاملOn Local Testability in Watson-Crick Finite Automata
Watson-Crick finite automata were first proposed in [2] inspired by formal language theory, finite states machines and some ingredients from DNA computing such as working with molecules as double stranded complementary strings. Here, we define different kinds of local testability in this model. Mainly, we will explore local testability in the upper (lower) strand and in the double strand.
متن کاملEvaluating Conceptual Modeling Languages
An important assumption for many KA researchers is structure preservation ; i.e. conceptual models can be converted in a straight forward manner into a design for an implementation. This assumption may not always hold. Seemingly trivial variants in a qualitative conceptual models can block pragmatically desirable properties such as KB-testability and KB-maintainability. KB-testability and KB-ma...
متن کامل